Application of Fuzzy Optimization to the Orienteering Problem
نویسندگان
چکیده
منابع مشابه
Particle Swarm Optimization for the Orienteering Problem
In this paper, we propose a Particle Swarm Optimization (PSO) based solution to the Orienteering Problem. A major problem in many PSO applications is the premature convergence of some particles to local optimums. To overcome this problem in our application, such particles are re-initiated; consequently, the exploration capability of PSO is improved. Furthermore, by employing Reduced Variable Ne...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولDiscrete particle swarm optimization for the team orienteering problem
In this paper, a novel discrete particle swarm optimization (PSO) algorithm is proposed to solve the team orienteering problem (TOP). Discrete evaluation is achieved by redefining all operators and operands used in PSO. To obtain better results, a strengthened PSO, which improves both exploration and exploitation during the search process, is employed. Our algorithm achieves the best known solu...
متن کاملThe Capacitated Team Orienteering Problem: Bee Colony Optimization
In this paper the capacitated team orienteering problem have been applied as a tool for carriers to avoid empty returns when trucks do not work with full load. The software based on bee colony optimization technique is developed for solving the problem. Numerical example is solved and the result is shown to depict the possibility of the proposed algorithm.
متن کاملThe probabilistic orienteering problem
The probabilistic orienteering problem (POP) is defined on a directed graph where a cost is associated with each arc and a prize is associated with each node. Moreover, each node will be available for visit only with a certain probability. A server starts from a fixed origin, has a given time limit to visit a subset of nodes, and ends at a fixed destination. In a first stage, a node subset has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Fuzzy Systems
سال: 2015
ISSN: 1687-7101,1687-711X
DOI: 10.1155/2015/569248